Estimation of Newly Established Iterative Scheme for Generalized Nonexpansive Mappings

Weak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings

The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...

Iterative Algorithms for Nonexpansive Mappings

for all x, y ∈ C. We use F T to denote the set of fixed points of T , that is, F T {x ∈ C : Tx x}. Throughout the paper, we assume that F T / ∅. Construction of fixed points of nonlinear mappings is an important and active research area. In particular, iterative methods for finding fixed points of nonexpansive mappings have received a vast investigation; see 1–28 . It is well known that the Pic...

Approximating fixed points of generalized nonexpansive mappings

Modified Iterative Algorithms for Nonexpansive Mappings

Let H be a real Hilbert space, let S, T be two nonexpansive mappings such that F S ∩ F T / ∅, let f be a contractive mapping, and let A be a strongly positive linear bounded operator on H. In this paper, we suggest and consider the strong converegence analysis of a new two-step iterative algorithms for finding the approximate solution of two nonexpansive mappings as xn 1 βnxn 1 − βn Syn, yn αnγ...

Convergence theorems of multi-step iterative algorithm with errors for generalized asymptotically quasi-nonexpansive mappings in Banach spaces

The purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in Banach spaces. Our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).